Montargis (Loiret). 13 rue Raymond Tellier

Results about Rue Resolution

Extensional Higher-Order Paramodulation and RUE-Resolution

This paper presents two approaches to primitive equality treatment in higher-order (HO) automated theorem proving: a calculus EP adapting traditional first-order (FO) paramodulation [RW69] , and a calculus ERUE adapting FO RUE-Resolution [Dig79] to classical type theory, i.e., HO logic based on Church’s simply typed λ-calculus. EP and ERUE extend the extensional HO resolution approach ER [BK98a...

Raymond Hu

35 rue Saint-Honoré, Fontainebleau

The graph matching problem is among the most important challenges of graph processing, and plays a central role in various fields of pattern recognition. We propose an approximate method for labeled weighted graph matching, based on a convexconcave programming approach which can be applied to the matching of large sized graphs. This method allows to easily integrate information on graph label s...

And-Or Graphs Applied to RUE Resolution

I n equa l i t y -based b ina ry r e s o l u t i o n , the v i a b i l i t y t e s t is used as a d e c i s i o n mechanism to s e l e c t disagreement sets and a lso to de f i ne the RUE u n i f i e r . In t h i s paper we solve the problem of n o n t e r m i n a t i o n o f the v i a b i l i t y t e s t by a p p l y i n g the theory of And-Or graphs. RUE r e f u t a t i o n s are succ inc t a...